Resource-independent Description of Information Graphs with Distributive Operations in the Set@l Programming Language

In the paper, we suggest to transform a standard sequential topology of an information graph with distributive operations into its hybrid version and parallel fragments. Such transformation allows provide efficient description calculations in resource-independent form. The result depends on available hardware resource reconfigurable system provides increase special performance comparison initial topology. We have developed algorithm linear structure various topologies according configuration computing system. is described Set@l programming language.